package LeetCode.NumOffer;

/**
 * 给定一个二叉树的前序遍历集合和中序遍历的集合，还原二叉树
 * @author lumin
 * @date 2022/03/28 16:45
 **/
public class NumOffer07 {
    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }
//    public TreeNode buildTree(int[] preorder, int[] inorder) {
//        if(preorder.length == 0 && inorder.length == 0){
//            return null;
//        }
//
//    }
}